A semismooth Newton method for topology optimization
نویسندگان
چکیده
منابع مشابه
The Josephy–newton Method for Semismooth Generalized Equations and Semismooth Sqp for Optimization
While generalized equations with differentiable single-valued base mappings and the associated Josephy–Newton method have been studied extensively, the setting with semismooth base mapping had not been previously considered (apart from the two special cases of usual nonlinear equations and of Karush-Kuhn-Tucker optimality systems). We introduce for the general semismooth case appropriate notion...
متن کاملA nonmonotone semismooth inexact Newton method
In this work we propose a variant of the inexact Newton method for the solution of semismooth nonlinear systems of equations. We introduce a nonmonotone scheme, which couples the inexact features with the nonmonotone strategies. For the nonmonotone scheme, we present the convergence theorems. Finally, we show how we can apply these strategies in the variational inequalities context and we prese...
متن کاملA semismooth Newton method for tensor eigenvalue complementarity problem
In this paper, we consider the tensor eigenvalue complementarity problem which is closely related to the optimality conditions for polynomial optimization, as well as a class of differential inclusions with nonconvex processes. By introducing an NCP-function, we reformulate the tensor eigenvalue complementarity problem as a system of nonlinear equations. We show that this function is strongly s...
متن کاملA feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible methods. However, some MCPs are not well defined outside the feasible region or the equivalent unconstrained reformulations of other MCPs contain local minimizers outside the feasible region. As both these problems coul...
متن کاملA Semismooth Newton Method for Tikhonov Functionals with Sparsity Constraints
Minimization problems in l for Tikhonov functionals with sparsity constraints are considered. Sparsity of the solution is ensured by a weighted l penalty term. The necessary and sufficient condition for optimality is shown to be slantly differentiable (Newton differentiable), hence a semismooth Newton method is applicable. Local superlinear convergence of this method is proved. Numerical exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Analysis: Theory, Methods & Applications
سال: 2010
ISSN: 0362-546X
DOI: 10.1016/j.na.2010.04.065